A blockchain index structure based on subchain query

نویسندگان

چکیده

Abstract Blockchain technology has the characteristics of decentralization and tamper resistance, which can store data safely reduce cost trust effectively. However, existing blockchain system weak performance in management, only supports traversal queries with transaction hashes as keywords. The query method based on account trace chain (ATTC) improves efficiency historical transactions account. querying accounts longer chains not been effectively improved. Given inefficiency single ATTC index query, we propose a subchain-based (SCATC) structure. First, is divided into subchains, last block each subchain connected by hash pointer. block-by-block mode converted to subchain-by-subchain mode, shortens path. Multiple same are merged stored, simplifies construction saves storage resources. then, algorithm given for SCATC Simulation analysis shows that structure significantly efficiency.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Private Key based query on encrypted data

Nowadays, users of information systems have inclination to use a central server to decrease data transferring and maintenance costs. Since such a system is not so trustworthy, users' data usually upkeeps encrypted. However, encryption is not a nostrum for security problems and cannot guarantee the data security. In other words, there are some techniques that can endanger security of encrypted d...

متن کامل

A Main Memory Index Structure to Query Linked Data

A possible approach to query Linked Data combines the actual evaluation of a query with the traversal of data links in order to discover and retrieve potentially relevant data. An implementation of this idea requires approaches that support an efficient and flexible management of temporary, ad hoc data collections that emerge during query execution. However, existing proposals for managing RDF ...

متن کامل

Hybrid Query Refinement: A Strategy for a Distance Based Index Structure to Refine Multimedia Queries

This paper proposes a hybrid query refinement model for distance-based index structures supporting contentbased image retrievals. The framework refines a query by considering both the low-level feature space as well as the high-level semantic interpretations separately. Thus, it successfully handles queries where the gap between the feature components and the semantics is large. It refines the ...

متن کامل

SkyMap: A Trie-Based Index Structure for High-Performance Skyline Query Processing

Skyline queries have become commonplace in many applications. The main problem is to efficiently find the set of Pareto-optimal choices from a large amount of database items. Several algorithms and indexing techniques have been proposed recently, but until now no indexing technique was able to address all problems for skyline queries in realistic applications: fast access, superior scalability ...

متن کامل

Index-based query processing on distributed multidimensional data

This work introduces decentralized query processing techniques based on MIDAS, a novel distributed multidimensional index. In particular, MIDAS implements a distributed k-d tree, where leaves correspond to peers, and internal nodes dictate message routing. MIDAS requires that peers maintain little network information, and features mechanisms that support fault tolerance and load balancing. The ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Cloud Computing

سال: 2021

ISSN: ['2326-6538']

DOI: https://doi.org/10.1186/s13677-021-00268-0